Rapid and Brief Communication An e$cient renovation on kernel Fisher discriminant analysis and face recognition experiments
نویسندگان
چکیده
A reformative kernel algorithm, which can deal with two-class problems as well as those with more than two classes, on Fisher discriminant analysis is proposed. In the novel algorithm the supposition that in feature space discriminant vector can be approximated by some linear combination of a part of training samples, called “signi6cant nodes”, is made. If the “signi6cant nodes” are found out, the novel algorithm on kernel Fisher discriminant analysis will be superior to the naive one in classi6cation e$ciency. In this paper, a recursive algorithm for selecting “signi6cant nodes”, is developed in detail. Experiments show that the novel algorithm is e9ective and much e$cient in classifying. ? 2004 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
منابع مشابه
Rapid and Brief Communication A reformative kernel Fisher discriminant analysis
A reformative kernel Fisher discriminant method is proposed, which is directly derived from the naive kernel Fisher discriminant analysis with superiority in classi1cation e2ciency. In the novel method only a part of training patterns, called “signi1cant nodes”, are necessary to be adopted in classifying one test pattern. A recursive algorithm for selecting “signi1cant nodes”, which is the key ...
متن کاملMultiple Kernel Learning in Fisher Discriminant Analysis for Face Recognition
Recent applications and developments based on support vector machines (SVMs) have shown that using multiple kernels instead of a single one can enhance classifier performance. However, there are few reports on performance of the kernel‐based Fisher discriminant analysis (kernel‐based FDA) method with multiple kernels. This paper proposes a multiple kernel construction ...
متن کاملRapid and Brief Communication A novel method for Fisher discriminant analysis
A novel model for Fisher discriminant analysis is developed in this paper. In the new model, maximal Fisher criterion values of discriminant vectors and minimal statistical correlation between feature components extracted by discriminant vectors are simultaneously required. Then the model is transformed into an extreme value problem, in the form of an evaluation function. Based on the evaluatio...
متن کاملManifold Adaptive Kernel Local Fisher Discriminant Analysis for Face Recognition
To efficiently cope with the high dimensionalities and complex nonlinear variations of face images in face recognition task, a novel manifold adaptive kernel local Fisher discriminant analysis algorithm is proposed in this paper. The core idea of this algorithm is as follows: First, the local manifold structure of the face image is modeled by a nearest neighbor graph. Then, an original input ke...
متن کاملE cient leave-one-out cross-validation of kernel Fisher discriminant classi'ers
Mika et al. (in: Neural Network for Signal Processing, Vol. IX, IEEE Press, New York, 1999; pp. 41–48) apply the “kernel trick” to obtain a non-linear variant of Fisher’s linear discriminant analysis method, demonstrating state-of-the-art performance on a range of benchmark data sets. We show that leave-one-out cross-validation of kernel Fisher discriminant classi'ers can be implemented with a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004